Success probability of the Hellman trade-off
نویسندگان
چکیده
Cryptanalytic time memory trade-off is a probabilistic algorithm for inverting a generic one-way function. Since its first introduction by Hellman, many variants and their analysis results have appeared. We present a new estimate for the success probability of the original Hellman trade-off, that is more accurate than the lower bound that is widely being used today.
منابع مشابه
امید ریاضی نرخ پوشش برای ماتریس‌های هلمن
Hellman’s time-memory trade-off is a probabilistic method for inverting one-way functions, using pre-computed data. Hellman introduced this method in 1980 and obtained a lower bound for the success probability of his algorithm. After that, all further analyses of researchers are based on this lower bound. In this paper, we first studied the expected coverage rate (ECR) of the Hellman matrice...
متن کاملA Hybrid Method Based on Fuzzy AHP and VIKOR for the Discrete Time-Cost-Quality Trade-off Problem
Time, cost and quality are considered as the main components in managing each project. Previous researches have mainly focused on the time-cost trade-off problems. Recently quality is considered as the most important factor in project�s success, which is influenced by time acceleration that is the less time is spent the more success is gained. In time-cost-quality trade-off problems, each act...
متن کاملOptimal Randomized Comparison Based Algorithms for Collision
We consider the well known problem of finding two identical elements, called a collision, in a list of n numbers. Here, the (very fast) comparison based algorithms are randomized and will only report existing collisions, and do this with (small) probability p, the success probability. We find a trade-off between p and the running time t, and show that this trade-off is optimal up to a constant ...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملCapacity price decisions, a manufacturing yield management perspective
This paper focuses on formulating capacity-price trade off problem in Yield Management for manufactur-ing industry by drawing motivation from the remarkable success of Yield Management (YM) implementation in airlines. In the current practice, there is no alternative and procedure for the manufacturer, as well as cus-tomers to take advantage of using the unfulfilled capacity in discounted offers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 109 شماره
صفحات -
تاریخ انتشار 2009